Connections between semidefinite relaxations of the max-cut and stable set problems

نویسندگان

  • Monique Laurent
  • Svatopluk Poljak
  • Franz Rendl
چکیده

We describe the links existing between a recently introduced semideenite relaxation for the max-cut problem and the well known semideenite relaxation for the stable set problem underlying the Lovv asz's theta function. It turns out that the connection between the convex bodies deening the semideenite relaxations mimics the connection existing between the corresponding poly-hedra. We also show how the semideenite relaxations can be combined with the classical linear relaxations in order to obtain tighter relaxations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 Parallel Semidefinite Programming and Combinatorial Optimization STEVEN

The use of semidefinite programming in combinatorial optimization continues to grow. This growth can be attributed to at least three factors: new semidefinite relaxations that provide tractable bounds to hard combinatorial problems, algorithmic advances in the solution of semidefinite programs (SDP), and the emergence of parallel computing. Solution techniques for minimizing combinatorial probl...

متن کامل

An Interior-Point Method for Semidefinite Programming

We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semidefinite matrices. We show that the approach is very efficient for graph bisection problems, such as max-cut. Other applications include max-min eigenvalue problems and relaxations for the stable set problem.

متن کامل

Exploring the Relationship Between Max-Cut and Stable Set Relaxations

The max-cut and stable set problems are two fundamental NP -hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set problem can be easily transformed into a max-cut instance. Moreover, Laurent, Poljak, Rendl and others have shown that any convex set containing the cut polytope yields, via a suitable projection, a convex set containing t...

متن کامل

Strengthened Semidefinite Programming Relaxations for the Max-cut Problem

In this paper we summarize recent results on finding tight semidefinite programming relaxations for the Max-Cut problem and hence tight upper bounds on its optimal value. Our results hold for every instance of Max-Cut and in particular we make no assumptions on the edge weights. We present two strengthenings of the well-known semidefinite programming relaxation of Max-Cut studied by Goemans and...

متن کامل

Semidefinite relaxation for dominating set

‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 77  شماره 

صفحات  -

تاریخ انتشار 1997